Cutwidth of triangular grids

Transonic Turbulent Flow Computations on Unstructured Triangular Grids

Generalised Triangular Grids in Digital Geometry

The hexagonal and the triangular grids are duals of each other. These two grids are the first and second ones in the family of triangular grids (we can call them as oneand two-planes triangular grids). This family comes from the mapping their points to Z3. Their symmetric properties are triangular. The next grid is the three-planes triangular grid, which looks like the mix of them. In this pape...

( ` , k ) - Routing on Plane Grids ∗

The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the (`, k)routing problem, each node can send at most ` packets and receive at most k packets. Permutation routing is the particular case ` = k = 1. In the r-central routing problem, all nodes at distance at ...

A Block Lu-sgs Implicit Dual Time-stepping Algorithm for Hybrid Dynamic Meshes

A block lower-upper symmetric Gauss-Seidel (BLU-SGS) implicit dual time-stepping method is developed for moving body problems with hybrid dynamic grids. To simulate flows over complex configurations, a hybrid grid method is adopted in this paper. Body-fitted quadrilateral (quad) grids are generated first near solid bodies. An adaptive Cartesian mesh is then generated to cover the entire computa...

Edge - Bandwidth

In this paper we discuss the edge-bandwidth of some families of graphs and characterize graphs by edge-bandwidth. In particular, bounds for m × n grids, triangular grids of size l, and the closure of the triangular grid T * l .